[20250731] BOJ / G1 / Team Selection / 권혁준 #581
Merged
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Contributor
|
5분 뭡니까 |
Contributor
|
G1이 5분만에 풀리는 거였구나 ㄷㄷ |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
🧷 문제 링크
https://www.acmicpc.net/problem/17240
🧭 풀이 시간
5분
👀 체감 난이도
✏️ 문제 설명
N명의 학생과 5개의 역할이 있다.
각 학생의 역할 별 실력은 a[i], b[i], c[i], d[i], e[i]로 주어진다.
N명 중 5명을 뽑아, 각 역할 별 실력 합의 최댓값을 구해보자.
🔍 풀이 방법
비트 5개를 사용하는 dp를 구성한다.
dp[mask] = max(dp[mask ^ (1<<k)] + arr[i][k], dp[mask])
⏳ 회고
피곤